Performance of binary polar codes with high - dimensional kernel 1
نویسندگان
چکیده
Upper union bound for the decoding error probability of polar codes with arbitrary binary kernels under the successive cancellation decoding is derived. The proposed approach is based on the representation of polar codes as multilevel ones.
منابع مشابه
Performance of binary polar codes with high-dimensional kernel
Upper union bound for the decoding error probability of polar codes with arbitrary binary kernels under the successive cancelation decoding is derived. The proposed approach is based on the representation of polar codes as multilevel ones.
متن کاملA New Construction of Nonbinary Polar Codes with Two-stage Polarization
In this paper, we propose a new class of nonbinary polar codes with two-stage polarization, where the outer polarization (symbol-level polarization) kernel is a nonbinary matrix resembling Arıkan’s kernel, and the inner polarization (bit-level polarization) kernel is a properly designed binary matrix. The encoder/decoder of the proposed nonbinary polar codes have the same structure as the origi...
متن کاملConvolutional Polar Codes
Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...
متن کاملUsing concatenated algebraic geometry codes in channel polarization
Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...
متن کاملA Multi-Kernel Multi-Code Polar Decoder Architecture
Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard. Most research on polar codes has focused on codes constructed from a 2×2 polarization matrix, called binary kernel: codes constructed from binary kernels have code lengths that are bound to powers of 2. A few recent works have proposed constructio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012